Random packing by ρ-connected ρ-regular graphs
نویسندگان
چکیده
منابع مشابه
On ρ-labeling 2-regular graphs consisting of 5-cycles
Let G be a graph of size n with vertex set V (G) and edge set E(G). A ρ-labeling of G is a one-to-one function h : V (G) → {0, 1, . . . , 2n} such that {min{|h(u)−h(v)|, 2n+1−|h(u)−h(v)|} : {u, v} ∈ E(G)} = {1, 2, . . . , n}. Such a labeling of G yields a cyclic G-decomposition of K2n+1. It is conjectured by El-Zanati and Vanden Eynden that every 2-regular graph G admits a ρ-labeling. We show t...
متن کاملAll 2-regular graphs with uniform odd components admit ρ-labellings
Let G be a graph of size n with vertex set V (G) and edge set E(G). A ρlabeling of G is a one-to-one function h : V (G) → {0, 1, . . . , 2n} such that {min{|h(u)−h(v)|, 2n+1−|h(u)−h(v)|} : {u, v} ∈ E(G)} = {1, 2, . . . , n}. Such a labeling of G yields a cyclicG-decomposition ofK2n+1. It is known that 2-regular bipartite graphs, the vertex-disjoint union of C3’s, and the vertex-disjoint union o...
متن کاملPacking vertices and edges in random regular graphs
In this paper we consider the problem of finding large collections of vertices and edges satisfying particular separation properties in random regular graphs of degree r, for each fixed r ≥ 3. We prove both constructive lower bounds and combinatorial upper bounds on the maximal sizes of these sets. The lower bounds are proved by analysing a class of algorithms that return feasible solutions for...
متن کامل– 1– the Ρ(1450) and the Ρ(1700)
In our 1988 edition, we replaced the ρ(1600) entry with two new ones, the ρ(1450) and the ρ(1700), because there was emerging evidence that the 1600-MeV region actually contains two ρ-like resonances. Erkal [1] had pointed out this possibility with a theoretical analysis on the consistency of 2π and 4π electromagnetic form factors and the ππ scattering length. Donnachie [2], with a full analysi...
متن کامل(φ,ρ)-monotonicity and Generalized (φ,ρ)-monotonicity
In this paper, new concepts of monotonicity, namely (Φ, ρ)-monotonicity, (Φ, ρ)-pseudo-monotonicity and (Φ, ρ)-quasi-monotonicityare introduced for functions defined in Banach spaces. Series of necessary conditions are also given that relate (Φ, ρ)-invexity and generalized (Φ, ρ)-invexity of the function with (Φ, ρ)monotonicity and generalized (Φ, ρ)-monotonicity of its gradient.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00147-o